Close

1. Identity statement
Reference TypeConference Paper (Conference Proceedings)
Sitesibgrapi.sid.inpe.br
Holder Codeibi 8JMKD3MGPEW34M/46T9EHH
Identifier6qtX3pFwXQZG2LgkFdY/MhDuP
Repositorysid.inpe.br/sibgrapi@80/2006/08.28.08.02
Last Update2006:08.28.08.02.43 (UTC) administrator
Metadata Repositorysid.inpe.br/sibgrapi@80/2006/08.28.08.02.44
Metadata Last Update2022:06.14.00.13.26 (UTC) administrator
DOI10.1109/SIBGRAPI.2006.16
Citation KeyCouprieSaudBert:2006:EuHoSk
TitleEuclidean homotopic skeleton based on critical kernels
FormatOn-line
Year2006
Access Date2024, Apr. 29
Number of Files1
Size284 KiB
2. Context
Author1 Couprie, Michel
2 Saude, André Vital
3 Bertrand, Gilles
Affiliation1 Institut Gaspard-Monge, Laboratoire A2SI, Groupe ESIEE
2 State University of Campinas, DCA-FEEC-UNICAMP
3 Institut Gaspard-Monge, Laboratoire A2SI, Groupe ESIEE
EditorOliveira Neto, Manuel Menezes de
Carceroni, Rodrigo Lima
e-Mail Addresscoupriem@esiee.fr
Conference NameBrazilian Symposium on Computer Graphics and Image Processing, 19 (SIBGRAPI)
Conference LocationManaus, AM, Brazil
Date8-11 Oct. 2006
PublisherIEEE Computer Society
Publisher CityLos Alamitos
Book TitleProceedings
Tertiary TypeFull Paper
History (UTC)2006-08-28 08:02:44 :: couprie -> banon ::
2006-08-30 21:48:26 :: banon -> couprie ::
2008-07-17 14:11:05 :: couprie -> administrator ::
2009-08-13 20:38:17 :: administrator -> banon ::
2010-08-28 20:02:26 :: banon -> administrator ::
2022-06-14 00:13:26 :: administrator -> :: 2006
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Version Typefinaldraft
Keywordsparallel thinning
Euclidean distance
medial axis
homotopy
critical kernels
AbstractCritical kernels constitute a general framework settled in the category of abstract complexes for the study of parallel thinning in any dimension. It allows to easily design parallel thinning algorithms which produce new types of skeletons, with specific geometrical properties, while guaranteeing their topological soundness. In this paper, we demonstrate that it is possible to define a skeleton based on the Euclidean distance, rather than on the common discrete distances, in the context of critical kernels. We provide the necessary definitions as well as an efficient algorithm to compute this skeleton.
Arrangement 1urlib.net > SDLA > Fonds > SIBGRAPI 2006 > Euclidean homotopic skeleton...
Arrangement 2urlib.net > SDLA > Fonds > Full Index > Euclidean homotopic skeleton...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Contentthere are no files
4. Conditions of access and use
data URLhttp://urlib.net/ibi/6qtX3pFwXQZG2LgkFdY/MhDuP
zipped data URLhttp://urlib.net/zip/6qtX3pFwXQZG2LgkFdY/MhDuP
Languageen
Target Fileeuclideankernels_versionfinale.pdf
User Groupcouprie
administrator
Visibilityshown
5. Allied materials
Next Higher Units8JMKD3MGPEW34M/46RFT7E
8JMKD3MGPEW34M/4742MCS
Citing Item Listsid.inpe.br/sibgrapi/2022/05.08.00.20 5
Host Collectionsid.inpe.br/banon/2001/03.30.15.38
6. Notes
Empty Fieldsarchivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination documentstage edition electronicmailaddress group isbn issn label lineage mark mirrorrepository nextedition notes numberofvolumes orcid organization pages parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url volume


Close